0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n017.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:06:34 EDT 2025
0.12/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.20/0.48	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.gEOZ1TRINX/E---3.1_2815.p
0.20/0.50	# Version: 3.0.0-ho
0.20/0.50	# partial match(1): HSSSSMSSSSMNHHA
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNHHN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.50	# Starting sh2lt with 240s (1) cores
0.20/0.50	# Starting ehoh_best8_lambda with 240s (1) cores
0.20/0.50	# Starting post_as_ho10 with 240s (1) cores
0.20/0.50	# sh2lt with pid 2894 completed with status 0
0.20/0.50	# Result found by sh2lt
0.20/0.50	# partial match(1): HSSSSMSSSSMNHHA
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNHHN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.50	# Starting sh2lt with 240s (1) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.20/0.50	# Search class: HGHSF-FFSF11-SHHFFMBN
0.20/0.50	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
0.20/0.50	# Starting new_ho_10 with 120s (1) cores
0.20/0.50	# new_ho_10 with pid 2904 completed with status 0
0.20/0.50	# Result found by new_ho_10
0.20/0.50	# partial match(1): HSSSSMSSSSMNHHA
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNHHN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.50	# Starting sh2lt with 240s (1) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.20/0.50	# Search class: HGHSF-FFSF11-SHHFFMBN
0.20/0.50	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
0.20/0.50	# Starting new_ho_10 with 120s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_sort1, type, a: $tType).
0.20/0.50	thf(decl_23, type, cX: a > $o).
0.20/0.50	thf(decl_24, type, esk1_0: a).
0.20/0.50	thf(decl_25, type, epred1_1: (a > $o) > (a > $o) > $o).
0.20/0.50	thf(decl_26, type, esk2_1: (a > $o) > a).
0.20/0.50	thf(decl_27, type, epred2_0: a > $o).
0.20/0.50	thf(decl_28, type, epred3_1: ((a > $o) > $o) > a > $o).
0.20/0.50	thf(decl_29, type, esk3_1: ((a > $o) > $o) > a).
0.20/0.50	thf(decl_31, type, epred5_0: a > $o).
0.20/0.50	thf(decl_32, type, epred6_2: a > (a > $o) > a > $o).
0.20/0.50	thf(cDOMLEMMA3_pme, conjecture, ((cX)=(^[X1:a]:(?[X2:a > $o]:(((![X3:(a > $o) > $o]:(((![X4:a > $o]:(((X3 @ X4)=>![X5:a]:(((X3 @ (^[X6:a]:(((X4 @ X6)|((X5)=(X6))))))<=(X2 @ X5)))))&(X3 @ (^[X7:a]:(~($true)))))=>(X3 @ X2)))&![X8:a]:(((cX @ X8)<=(X2 @ X8))))&(X2 @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.gEOZ1TRINX/E---3.1_2815.p', cDOMLEMMA3_pme)).
0.20/0.50	thf(c_0_1, negated_conjecture, ~(![X9:a]:(((cX @ X9)<=>?[X2:a > $o]:(((![X3:(a > $o) > $o]:(((![X4:a > $o]:(((X3 @ X4)=>![X5:a]:(((X2 @ X5)=>(X3 @ (^[Z0/* 9 */:a]:((X4 @ Z0|((X5)=(Z0))))))))))&(X3 @ (^[Z0/* 7 */:a]:(~($true)))))=>(X3 @ X2)))&![X8:a]:(((X2 @ X8)=>(cX @ X8))))&(X2 @ X9)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cDOMLEMMA3_pme])])])])).
0.20/0.50	thf(c_0_2, negated_conjecture, ![X11:a > $o, X13:a > $o, X14:a, X17:(a > $o) > $o, X20:a]:(((((((X11 @ (esk2_1 @ X11))|(~(epred1_1 @ X11 @ X13)|(~(X11 @ X14)|(epred1_1 @ X11 @ (^[Z0/* 9 */:a]:((X13 @ Z0|((X14)=(Z0))))))))|~(X11 @ esk1_0)|~(cX @ esk1_0))&(~(cX @ (esk2_1 @ X11))|(~(epred1_1 @ X11 @ X13)|(~(X11 @ X14)|(epred1_1 @ X11 @ (^[Z0/* 9 */:a]:((X13 @ Z0|((X14)=(Z0))))))))|~(X11 @ esk1_0)|~(cX @ esk1_0)))&(((X11 @ (esk2_1 @ X11))|(epred1_1 @ X11 @ (^[Z0/* 7 */:a]:(~($true))))|~(X11 @ esk1_0)|~(cX @ esk1_0))&(~(cX @ (esk2_1 @ X11))|(epred1_1 @ X11 @ (^[Z0/* 7 */:a]:(~($true))))|~(X11 @ esk1_0)|~(cX @ esk1_0))))&(((X11 @ (esk2_1 @ X11))|~(epred1_1 @ X11 @ X11)|~(X11 @ esk1_0)|~(cX @ esk1_0))&(~(cX @ (esk2_1 @ X11))|~(epred1_1 @ X11 @ X11)|~(X11 @ esk1_0)|~(cX @ esk1_0))))&(((((X17 @ (epred3_1 @ X17))|~(X17 @ (^[Z0/* 7 */:a]:(~($true))))|(X17 @ epred2_0)|(cX @ esk1_0))&(((epred2_0 @ (esk3_1 @ X17))|~(X17 @ (^[Z0/* 7 */:a]:(~($true))))|(X17 @ epred2_0)|(cX @ esk1_0))&(~(X17 @ (^[Z0/* 9 */:a]:((epred3_1 @ X17 @ Z0|((esk3_1 @ X17)=(Z0))))))|~(X17 @ (^[Z0/* 7 */:a]:(~($true))))|(X17 @ epred2_0)|(cX @ esk1_0))))&(~(epred2_0 @ X20)|(cX @ X20)|(cX @ esk1_0)))&((epred2_0 @ esk1_0)|(cX @ esk1_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.20/0.50	thf(c_0_3, plain, ![X22:a]:(((epred5_0 @ X22)<=>~(($true)))), introduced(definition)).
0.20/0.50	thf(c_0_4, negated_conjecture, ![X2:a > $o]:(((X2 @ (esk2_1 @ X2))|(((epred1_1 @ X2 @ epred5_0))=(($true)))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
0.20/0.50	thf(c_0_5, negated_conjecture, ![X1:a]:(((cX @ X1)|(cX @ esk1_0)|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_6, negated_conjecture, ((epred2_0 @ esk1_0)|(cX @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_7, plain, ![X29:a]:(((~(epred5_0 @ X29)|~($true))&(($true)|(epred5_0 @ X29)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
0.20/0.50	thf(c_0_8, plain, ![X32:a, X33:a > $o, X34:a]:(((~(epred6_2 @ X34 @ X33 @ X32)|((X33 @ X32)|((X34)=(X32))))&((~(X33 @ X32)|(epred6_2 @ X34 @ X33 @ X32))&(((X34)!=(X32))|(epred6_2 @ X34 @ X33 @ X32))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
0.20/0.50	thf(c_0_9, negated_conjecture, ![X2:a > $o]:(((epred1_1 @ X2 @ epred5_0)|(X2 @ (esk2_1 @ X2))|~((cX @ esk1_0))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[c_0_4])).
0.20/0.50	thf(c_0_10, negated_conjecture, (cX @ esk1_0), inference(spm,[status(thm)],[c_0_5, c_0_6])).
0.20/0.50	thf(c_0_11, plain, ![X27:a, X4:a > $o, X1:a]:(((epred6_2 @ X1 @ X4 @ X27)<=>((X4 @ X27)|((X1)=(X27))))), introduced(definition)).
0.20/0.50	thf(c_0_12, negated_conjecture, ![X2:a > $o]:(((((epred1_1 @ X2 @ epred5_0))=(($true)))|~((cX @ (esk2_1 @ X2)))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
0.20/0.50	thf(c_0_13, plain, ![X1:a]:((~((epred5_0 @ X1))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.50	thf(c_0_14, plain, ![X1:a, X2:a > $o, X5:a]:(((X2 @ X5)|((X1)=(X5))|~((epred6_2 @ X1 @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.50	thf(c_0_15, negated_conjecture, ![X2:a > $o]:(((epred1_1 @ X2 @ epred5_0)|(X2 @ (esk2_1 @ X2))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])).
0.20/0.50	thf(c_0_16, negated_conjecture, ![X1:a, X4:a > $o, X2:a > $o]:(((X2 @ (esk2_1 @ X2))|(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X4)))=(($true)))|~((epred1_1 @ X2 @ X4))|~((X2 @ X1))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_11])).
0.20/0.50	thf(c_0_17, negated_conjecture, ![X2:a > $o]:(((epred1_1 @ X2 @ epred5_0)|~((cX @ (esk2_1 @ X2)))|~((cX @ esk1_0))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[c_0_12])).
0.20/0.50	thf(c_0_18, plain, ![X1:a]:(~((epred5_0 @ X1))), inference(cn,[status(thm)],[c_0_13])).
0.20/0.50	thf(c_0_19, plain, ![X1:a, X2:a > $o]:((((esk2_1 @ (epred6_2 @ X1 @ X2))=(X1))|(epred1_1 @ (epred6_2 @ X1 @ X2) @ epred5_0)|(X2 @ (esk2_1 @ (epred6_2 @ X1 @ X2)))|~((epred6_2 @ X1 @ X2 @ esk1_0)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.20/0.50	thf(c_0_20, negated_conjecture, ![X4:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X4))|(X2 @ (esk2_1 @ X2))|~((cX @ esk1_0))|~((epred1_1 @ X2 @ X4))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[c_0_16])).
0.20/0.50	thf(c_0_21, negated_conjecture, ![X2:a > $o]:(((epred1_1 @ X2 @ epred5_0)|~((cX @ (esk2_1 @ X2)))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_10])])).
0.20/0.50	thf(c_0_22, plain, ![X1:a]:((((esk2_1 @ (epred6_2 @ X1 @ epred5_0))=(X1))|(epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ epred5_0)|~((epred6_2 @ X1 @ epred5_0 @ esk1_0)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.50	thf(c_0_23, negated_conjecture, ![X4:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X4))|(X2 @ (esk2_1 @ X2))|~((epred1_1 @ X2 @ X4))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_10])])).
0.20/0.50	thf(c_0_24, negated_conjecture, ![X1:a]:(((epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ epred5_0)|~((epred6_2 @ X1 @ epred5_0 @ esk1_0))|~((cX @ X1)))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.20/0.50	thf(c_0_25, plain, ![X1:a, X2:a > $o, X5:a]:(((epred6_2 @ X1 @ X2 @ X5)|((X1)!=(X5)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.50	thf(c_0_26, negated_conjecture, ![X5:a, X1:a]:(((epred6_2 @ X1 @ epred5_0 @ (esk2_1 @ (epred6_2 @ X1 @ epred5_0)))|(epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ (epred6_2 @ X5 @ epred5_0))|~((epred6_2 @ X1 @ epred5_0 @ esk1_0))|~((epred6_2 @ X1 @ epred5_0 @ X5))|~((cX @ X1)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.20/0.50	thf(c_0_27, plain, ![X2:a > $o, X1:a]:((epred6_2 @ X1 @ X2 @ X1)), inference(er,[status(thm)],[c_0_25])).
0.20/0.50	thf(c_0_28, negated_conjecture, ![X2:a > $o]:(((X2 @ (esk2_1 @ X2))|~((epred1_1 @ X2 @ X2))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_29, plain, ![X1:a]:(((epred6_2 @ esk1_0 @ epred5_0 @ (esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0)))|(epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ X1 @ epred5_0))|~((epred6_2 @ esk1_0 @ epred5_0 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_10])])).
0.20/0.50	thf(c_0_30, negated_conjecture, ![X2:a > $o]:(((X2 @ (esk2_1 @ X2))|~((epred1_1 @ X2 @ X2))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_10])])).
0.20/0.50	thf(c_0_31, plain, ((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))|(epred6_2 @ esk1_0 @ epred5_0 @ (esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0)))), inference(spm,[status(thm)],[c_0_29, c_0_27])).
0.20/0.50	thf(c_0_32, negated_conjecture, ![X2:a > $o]:((~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X2))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_33, plain, ![X1:a, X2:a > $o]:((((esk2_1 @ (epred6_2 @ X1 @ X2))=(X1))|(X2 @ (esk2_1 @ (epred6_2 @ X1 @ X2)))|~((epred1_1 @ (epred6_2 @ X1 @ X2) @ (epred6_2 @ X1 @ X2)))|~((epred6_2 @ X1 @ X2 @ esk1_0)))), inference(spm,[status(thm)],[c_0_14, c_0_30])).
0.20/0.50	thf(c_0_34, plain, (((esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0))=(esk1_0))|(epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_31]), c_0_18])).
0.20/0.50	thf(c_0_35, negated_conjecture, ![X1:a, X4:a > $o, X2:a > $o]:(((((epred1_1 @ X2 @ (epred6_2 @ X1 @ X4)))=(($true)))|~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X4))|~((X2 @ X1))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_11])).
0.20/0.50	thf(c_0_36, negated_conjecture, ![X2:a > $o]:((~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X2))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_10])])).
0.20/0.50	thf(c_0_37, plain, ((esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0))=(esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_27])]), c_0_18])).
0.20/0.50	thf(c_0_38, negated_conjecture, ![X4:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X4))|~((cX @ (esk2_1 @ X2)))|~((cX @ esk1_0))|~((epred1_1 @ X2 @ X4))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[c_0_35])).
0.20/0.50	thf(c_0_39, negated_conjecture, ~((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_10]), c_0_27])])).
0.20/0.50	thf(c_0_40, negated_conjecture, ![X4:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X4))|~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X4))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38, c_0_10])])).
0.20/0.50	thf(c_0_41, negated_conjecture, ~((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ epred5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_37]), c_0_10]), c_0_27])])).
0.20/0.50	thf(c_0_42, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_24]), c_0_27]), c_0_10])]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 3
0.20/0.50	# Removed by relevancy pruning/SinE    : 2
0.20/0.50	# Initial clauses                      : 19
0.20/0.50	# Removed in clause preprocessing      : 1
0.20/0.50	# Initial clauses in saturation        : 18
0.20/0.50	# Processed clauses                    : 84
0.20/0.50	# ...of these trivial                  : 2
0.20/0.50	# ...subsumed                          : 11
0.20/0.50	# ...remaining for further processing  : 71
0.20/0.50	# Other redundant clauses eliminated   : 2
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 0
0.20/0.50	# Backward-rewritten                   : 11
0.20/0.50	# Generated clauses                    : 89
0.20/0.50	# ...of the previous two non-redundant : 77
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 0
0.20/0.50	# Paramodulations                      : 87
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 2
0.20/0.50	# Disequality decompositions           : 0
0.20/0.50	# Total rewrite steps                  : 61
0.20/0.50	# ...of those cached                   : 54
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 40
0.20/0.50	#    Positive orientable unit clauses  : 5
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 4
0.20/0.50	#    Non-unit-clauses                  : 31
0.20/0.50	# Current number of unprocessed clauses: 24
0.20/0.50	# ...number of literals in the above   : 113
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 29
0.20/0.50	# Clause-clause subsumption calls (NU) : 827
0.20/0.50	# Rec. Clause-clause subsumption calls : 256
0.20/0.50	# Non-unit clause-clause subsumptions  : 8
0.20/0.50	# Unit Clause-clause subsumption calls : 8
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 3
0.20/0.50	# BW rewrite match successes           : 2
0.20/0.50	# Condensation attempts                : 87
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 5961
0.20/0.50	# Search garbage collected termcells   : 525
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.013 s
0.20/0.50	# System time              : 0.002 s
0.20/0.50	# Total time               : 0.016 s
0.20/0.50	# Maximum resident set size: 1900 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.016 s
0.20/0.50	# System time              : 0.003 s
0.20/0.50	# Total time               : 0.019 s
0.20/0.50	# Maximum resident set size: 1740 pages
0.20/0.50	% E exiting
0.20/0.50	% E exiting
0.20/0.50	EOF